Presenting locale pullback via directed complete posets
نویسندگان
چکیده
منابع مشابه
Presenting locale pullback via directed complete posets
This paper shows how to describe the pullbacks of directed complete posets (dcpos) along geometric morphisms. This extends Joyal and Tierney’s original results on the pullbacks of suplattices. It is then shown how to treat every frame as a dcpo and so locale pullback is described in this way. Applications are given describing triquotient assignments in terms of internal dcpo maps, leading to pu...
متن کاملMeet-continuity on $L$-directed Complete Posets
In this paper, the definition of meet-continuity on $L$-directedcomplete posets (for short, $L$-dcpos) is introduced. As ageneralization of meet-continuity on crisp dcpos, meet-continuity on$L$-dcpos, based on the generalized Scott topology, ischaracterized. In particular, it is shown that every continuous$L$-dcpo is meet-continuous and $L$-continuous retracts ofmeet-continuous $L$-dcpos are al...
متن کاملmeet-continuity on $l$-directed complete posets
in this paper, the definition of meet-continuity on $l$-directedcomplete posets (for short, $l$-dcpos) is introduced. as ageneralization of meet-continuity on crisp dcpos, meet-continuity on$l$-dcpos, based on the generalized scott topology, ischaracterized. in particular, it is shown that every continuous$l$-dcpo is meet-continuous and $l$-continuous retracts ofmeet-continuous $l$-dcpos are al...
متن کاملActions of a separately strict cpo-monoid on pointed directed complete posets
In the present article, we study some categorical properties of the category {$bf Cpo_{Sep}$-$S$} of all {separately strict $S$-cpo's}; cpo's equipped with a compatible right action of a separately strict cpo-monoid $S$ which is strict continuous in each component. In particular, we show that this category is reflective and coreflective in the category of $S$-cpo's, find the free a...
متن کاملChain-complete posets and directed sets with applications
Let a poset P be called chain-complete when every chain, including the empty chain, has a sup in P. Many authors have investigated properties of posets satisfying some sort of chain-completeness condition (see [,11, [-31, [6], I-71, [17], [,181, ['191, [,211, [,221), and used them in a variety of applications. In this paper we study the notion of chain-completeness and demonstrate its usefulnes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.01.032